On criteria for rook equivalence of Ferrers boards

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rook Poset Equivalence of Ferrers Boards

A natural construction due to K. Ding yields Schubert varieties from Ferrers boards. The poset structure of the Schubert cells in these varieties is equal to the poset of maximal rook placements on the Ferrers board under the Bruhat order. We determine when two Ferrers boards have isomorphic rook posets. Equivalently, we give an exact categorization of when two Ding Schubert varieties have iden...

متن کامل

The Inverse Rook Problem on Ferrers Boards

Rook polynomials have been studied extensively since 1946, principally as a method for enumerating restricted permutations. However, they have also been shown to have many fruitful connections with other areas of mathematics, including graph theory, hypergeometric series, and algebraic geometry. It is known that the rook polynomial of any board can be computed recursively. [19, 18] The naturall...

متن کامل

Rooks on Ferrers Boards and Matrix Integrals

Let C(n; N) = R H N tr Z 2n (dZ) denote a matrix integral by a U(N)-invariant gaussian measure on the space H N of hermitian N N matrices. The integral is known to be always a positive integer. We derive a simple combinatorial interpretation of this integral in terms of rook conngurations on Ferrers boards. The formula C(n; N) = (2n ? 1)!! n X k=0 N k + 1 n k 2 k found by J. Harer and D. Zagier...

متن کامل

Augmented Rook Boards and General Product Formulas

There are a number of so-called factorization theorems for rook polynomials that have appeared in the literature. For example, Goldman, Joichi and White [6] showed that for any Ferrers board B = F (b1, b2, . . . , bn), n

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2019

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2018.08.006